Homogeneity Test of Many-to-One Risk Differences for Correlated Binary Data under Optimal Algorithms
نویسندگان
چکیده
منابع مشابه
Homogeneity Test for Correlated Binary Data
In ophthalmologic studies, measurements obtained from both eyes of an individual are often highly correlated. Ignoring the correlation could lead to incorrect inferences. An asymptotic method was proposed by Tang and others (2008) for testing equality of proportions between two groups under Rosner's model. In this article, we investigate three testing procedures for general g ≥ 2 groups. Our si...
متن کاملMantel-Haenszel test statistics for correlated binary data.
This paper proposes two new Mantel-Haenszel test statistics for correlated binary data in 2 x 2 tables that are asymptotically valid in both sparse data (many strata) and large-strata limiting models. Monte Carlo experiments show that the statistics compare favorably to previously proposed test statistics, especially for 5-25 small to moderate-sized strata. Confidence intervals are also obtaine...
متن کاملAn Approximate Test for Homogeneity of Correlated Correlation Coefficients
This paper develops and evaluates an approximate procedure for testing homogeneity of an arbitrary subset of correlation coefficients among variables measured on the same set of individuals. The sample may have some missing data. The simple test statistic is a multiple of the variance of Fisher r-to-z transformed correlation coefficients relevant to the null hypothesis being tested and is refer...
متن کاملAnalysis of Correlated Binary Data under Partially Linear Logistic Models
Clustered data arise commonly in practice and it is often of interest to estimate the mean response parameters as well as the association parameters. However, most research has been directed to address the mean response parameters with the association parameters relegated to a nuisance role. There is little work concerning both the marginal and association structures, especially in the semipara...
متن کاملOptimal algorithms for the many-to-one routing problem on two-dimensional meshes
In this paper, we consider the many-to-one packet routing problem on the mesh parallel architecture. This problem has not been considered before. It models the communication pattern that occurs when many processors try to write on the same memory location on a Concurrent Read Concurrent Write Shared Memory parallel machine. We prove that there is an instance of the many-to-one packet routing pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 2021
ISSN: 1099-0526,1076-2787
DOI: 10.1155/2021/6685951